Priority Auctions and Queue Disciplines That Depend on Processing Time
نویسندگان
چکیده
منابع مشابه
Priority Auctions and Queue Disciplines That Depend on Processing Time
We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that differ in the definition of bids (these may reflect either total payments or payments per unit of time) ...
متن کاملPseudo-conservation Law for Discrete-time Multi-queue Systems with Priority Disciplines
We consider a discrete-time cyclic-service system consisting of multiple stations visited by a single server. Customers from several priority classes arrive at an individual station according to independent batch Bernoulli processes. We assume a non-preemptive priority rule and non-zero switch-over times of the server between consecutive stations. 'Ve derive an exact expression for a weighted s...
متن کاملAuction-Based Queue Disciplines
Each one of several impatient agents has a job that needs to be processed by a server. The server can process the jobs sequentially, one at a time. Agents are privately informed about the realization of a random variable representing processing time. If the cost of delay is represented by a concave function of waiting time till job completion, the efficient shortest processing time first schedu...
متن کاملNorwegian Priority Setting in Practice – an Analysis of Waiting Time Patterns Across Medical Disciplines
Background Different strategies for addressing the challenge of prioritizing elective patients efficiently and fairly have been introduced in Norway. In the time period studied, there were three possible outcomes for elective patients that had been through the process of priority setting: (i) high priority with assigned individual maximum waiting time; (ii) low priority without a maximum waitin...
متن کاملTime-dependent performance analysis of a discrete-time priority queue
We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 2005
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.1040.0301